Procedures for Computing the Maximum with DNA Strands
نویسندگان
چکیده
In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable attention as one of nonsilicon based computings. In this paper, we consider three procedures for computing the maximum of binary numbers of bits, which are represented with DNA strands. The first procedure computes the maximum of the binary numbers in steps using kinds of DNA strands. The second and third procedures also compute the maximum in and steps using and kinds of DNA strands, respectively.
منابع مشابه
Parallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کاملSorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands
In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable attention as one of non-silicon based computing. In this paper, we propose two procedures for sorting with DNA strands. An input of the algorithms is a set of binary numbers of bits, which are denoted by kinds of DNA strands. We first propose a procedure for the compare-and-e...
متن کاملProcedures for multiplication and division in DNA computing
In this paper, we propose two procedures for multiplication and division using DNA strands. We first show a procedure for multiplication of a pair of two binary numbers. The procedure executes multiplication for two binary numbers of bits in steps using DNA strands. The procedure mainly consists of bit-shift and addition operations. We next show a procedure for division of a pair of two binary ...
متن کاملAddressable Procedures for Logic and Arithmetic Operations with DNA Strands
Abstract: In this paper, we consider addressable procedures with DNA strands for logic and arithmetic operations. Using a theoretical model for DNA computing, we first show a DNA representation of binary numbers of bits, and propose a procedure to assign values for the representation. The procedure is applicable to binary numbers of bits in lab steps in parallel. Next, we propose a procedure fo...
متن کاملA Procedure for Max-SAT with DNA Strands
In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has had considerable attention as one of non-silicon based computing. Using features of DNA molecules, we can solve some optimization problems, which usually need exponential time on a silicon based computer, in a polynomial number of steps with DNA molecules. In this paper, we propose a proc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003